Ergodic Mean-Field Games with aggregation of Choquard-type
نویسندگان
چکیده
We consider second-order ergodic Mean-Field Games systems in the whole space $\mathbb{R}^N$ with coercive potential and aggregating nonlocal coupling, defined terms of a Riesz interaction kernel. These MFG describe Nash equilibria games large population indistinguishable rational players attracted toward regions where is highly distributed. Equilibria solve system PDEs an Hamilton-Jacobi-Bellman equation combined Kolmogorov-Fokker-Planck for mass distribution. Due to interplay between strength attractive term behavior diffusive part, we will obtain three different regimes existence non classical solutions system. By means Pohozaev-type identity, prove nonexistence regular without Hardy-Littlewood-Sobolev-supercritical regime. On other hand, using fixed point argument, show Hardy-Littlewood-Sobolev-subcritical regime at least masses smaller than given threshold value. In mass-subcritical that actually this can be taken $+\infty$.
منابع مشابه
Ergodic Mean Field Games with Hörmander diffusions
I will present joint results with Federica Dragoni (Cardiff University, UK) on existence, uniqueness and regularity of solutions for a class of systems of subelliptic or hypoelliptic PDEs arising from ergodic Mean Field Game models with Hörmander diffusions [5]. These results are applied to the feedback synthesis of Mean Field Game solutions and Nash equilibria of a large class of Nplayer diffe...
متن کاملOn solutions of mean field games with ergodic cost
Article history: Received 29 September 2015 Available online 23 June 2016 MSC: primary 91A13, 93E20 secondary 82B05
متن کاملCooperative Mean-Field Type Games
In the standard formulation of a game, a player’s payoff function depends on the states and actions of all the players. Yet, real world applications suggest to consider also a functional of the probability measure of states and actions of all the players. In this paper, we consider cooperative mean-field type games in which the state dynamics and the payoffs depend not only on the state and act...
متن کاملThe Complexity of Ergodic Mean-payoff Games
We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergo...
متن کاملMean Field Stackelberg Games: Aggregation of Delayed Instructions
In this paper, we consider an N-player interacting strategic game in the presence of a (endogenous) dominating player, who gives direct influence on individual agents, through its impact on their control in the sense of Stackelberg game, and then on the whole community. Each individual agent is subject to a delay effect on collecting information, specifically at a delay time, from the dominatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2023
ISSN: ['1090-2732', '0022-0396']
DOI: https://doi.org/10.1016/j.jde.2023.03.045